Benders decomposition for the uncapacitated multiple allocation hub location problem
نویسندگان
چکیده
In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destination, the flows are concentrated with others at facilities called hubs. These flows are transported on links established between hubs, being then splitted and delivered to its final destination. Systems with this sort of topology are named hub-and-spoke (HS) systems or hub-and-spoke networks. They are designed to exploit the scale economies attainable through the shared use of high capacity links between hubs. Therefore, the problem is to find the least expensive HS network, selecting hubs and assigning traffic to them, given the demands between each origin–destination pair and the respective transportation costs. In the present paper, we present efficient Benders decomposition algorithms based on a well known formulation to tackle the UMAHLP. We have been able to solve some large instances, considered ‘out of reach’ of other exact methods in reasonable time. 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Robust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations
The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...
متن کاملScenario-based modeling for multiple allocation hub location problem under disruption risk: multiple cuts Benders decomposition approach
The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of ...
متن کاملUncapacitated phub center problem under uncertainty
Hubs are facilities to collect arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this paper, an uncapacitated phub center problem in case of single allocation and also multiple allocation will be introduced in which travel times or transportation costs are considered as fuzzy parameters. Then, by proposing new methods, the presented problem is con...
متن کاملA Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs
In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...
متن کاملMathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 35 شماره
صفحات -
تاریخ انتشار 2008